Lagrangian pairs and Lagrangian orthogonal matroids
نویسندگان
چکیده
Represented Coxeter matroids of types Cn and Dn, that is, symplectic and orthogonal matroids arising from totally isotropic subspaces of symplectic or (even-dimensional) orthogonal spaces, may also be represented in buildings of type Cn and Dn, respectively (see [4, Chapter 7]). Indeed, the particular buildings involved are those arising from the flags or oriflammes, respectively, of totally isotropic subspaces. There are also buildings of type Bn arising from flags of totally isotropic subspaces in odd-dimensional orthogonal space. Coxeter matroids of type Bn are the same as those of type Cn (since they depend only upon the directions of roots, not the length of roots—see the Gelfand-Serganova Theorem below). However, buildings of type Bn are distinct from those of the other types. Thus the question arises ∗Supported by EPSRC Grant GR/R53593.
منابع مشابه
Oriented Lagrangian Orthogonal Matroid Representations
Several attempts have been made to extend the theory of matroids (here referred to as ordinary or classical matroids) to theories of more general objects, in particular the Coxeter matroids of Borovik, Gelfand and White ([7], first introduced as WP-matroids in [10]), and the ∆-matroids and (equivalent but for notation) symmetric matroids of Bouchet (see, for example, [8]). The special cases of ...
متن کاملLagrangian Matroids: Representations of Type Bn
Coxeter matroids are combinatorial objects associated with finite Coxeter groups; they can be viewed as subsets M of the factor set W/P of a Coxeter group W by a parabolic subgroup P which satisfy a certain maximality property with respect to a family of shifted Bruhat orders on W/P . The classical matroids of matroid theory are exactly the Coxeter matroids for the symmetric group Symn (which i...
متن کاملLagrangian Matroids Associated with Maps on Orientable Surfaces
The aim of this paper is to clarify the nature of combinatorial structures associated with maps on closed compact surfaces. These are fairly classical objects; however, not long ago it was discovered by A. Bouchet that maps are associated with ∆-matroids [7] (or Lagrangian matroids in the terminology of [4]). ∆-matroids are related to maps in almost the same way as ordinary matroids to graphs. ...
متن کاملThe Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint
In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...
متن کاملMatroid Homology
We construct chain complexes of matroids and Lagrangian symplectic matroids analogous to Kontsevich graph homology.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 26 شماره
صفحات -
تاریخ انتشار 2005